The Boyer-moore Prover and Nuprl: an Experimental Comparison
نویسنده
چکیده
We use an example to compare the Boyer-Moore Theorem Prover and the Nuprl Proof Development System. The respective machine veriications of a version of Ramsey's theorem illustrate similarities and diierences between the two systems. The proofs are compared using both quantitative and non-quantitative measures, and we examine diiculties in making such comparisons.
منابع مشابه
A Theorem Prover for a Computational Logic
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, known both as NQTHM and as the Boyer-Moore prover, contains a mechanized principle of induction and implementations of linear resolution, rewriting, and arithmetic decision procedures. We describe some applications of th...
متن کاملAn example in NQTHM: Ramsey's Theorem
We present here a proof of Ramsey's Theorem for exponent 2 using the Boyer-Moore theorem prover. The presentation is intended to be in a style to assist those who want to learn how to improve their eeectiveness in using the Boyer-Moore logic and theorem prover.
متن کاملThe Verification of a Bit-slice ALU
The verification of a bit-slice ALU has been accomplished using a mechanical theorem prover. This ALU has an n-bit design specification, which has been verified to implement its top-level specification. The ALU and top-level specifications were written in the Boyer-Moore logic. The verification was carried out with the aid of Boyer-Moore theorem prover in a hierarchical fashion.
متن کاملA User’s Manual for an Interactive Enhancement to the Boyer-Moore Theorem Prover
Acknowledgements An early version of part of this system was written by J Moore, who I also thank for suggesting this project. Also, Bob Boyer and J Moore have been very helpful in answering questions about their theorem prover. I also thank David Goldschlag, Carl Pixley, Matt Wilding, and Bill Young for their helpful feedback in the development of this system. Finally, I truly appreciate the c...
متن کاملAn Interactive Enhancement to the Boyer-Moore Theorem Prover
Acknowledgements An early version of part of this system was written by J Moore, who I also thank for suggesting this project. Also, Bob Boyer and J Moore have been very helpful in answering questions about their theorem prover. I also thank David Goldschlag, Carl Pixley, Matt Wilding, and Bill Young for their helpful feedback in the development of this system. Finally, I truly appreciate the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991